Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving
نویسندگان
چکیده
We define the weighted-sequence problem inspired by an important industrial problem in oracle query optimization. We evaluate several approaches to solving this problem using answer set programming (ASP) system clingo and constraint answer set programming (CASP) solver clingcon. The focus of this paper is an experimental evaluation of search procedures behind clingo and clingcon. We used instances of the weighted-sequence problem where integer parameters were quite small so that grounding was not an issue and we could focus on comparison of the effectiveness of the clingo and clingcon solvers. Our key finding is that the effectiveness of the search procedure used by clingcon lags behind that of clingo. It points to the need for further research on the integration of ASP and CSP technologies.
منابع مشابه
Modern Constraint Answer Set Solving
Answer Set Programming (ASP) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance solving capabilities. Although this has already resulted in various applications, certain aspects of such applications are more naturally modeled using variables over finite domains, for accounting for resources, fine timings, coordinates, or functions. Our...
متن کاملDisagreement and Degrees of Assertiveness in Service Encounters: Purchase vs Problem-Solving Interactions
This paper examined disagreement in two sets of data in the context of service encounters: problem-solving interactions (doctor-patient communication) and purchase-oriented encounters (pharmacies) from a cross-cultural perspective (Spanish-British English). We proposed assertiveness, a term that refers to both socio-psychological and linguistic features of communication, as a concept that may h...
متن کاملModeling negotiation using multi-focused answer sets
Answer Set Programming (ASP) is a form of declarative programming based on the stable model semantics [5]. The idea of ASP is to represent a computational problem by a set of (propositional) rules P such that particular minimal models of P , the stable models, correspond to the solutions of the original problem. ASP has proven successful as an elegant and convenient vehicle for commonsense reas...
متن کاملEfficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks
This article presents the use of Answer Set Programming (ASP) to mine sequential patterns. ASP is a high-level declarative logic programming paradigm for high level encoding combinatorial and optimization problem solving as well as knowledge representation and reasoning. Thus, ASP is a good candidate for implementing pattern mining with background knowledge, which has been a data mining issue f...
متن کاملA fuzzy multi-objective linear programming approach for solving a new multi-objective job shop scheduling with sequence-dependent setup times
This paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. For solving this multi-objective model, we develop a fuzzy multi-objective linear programming (FMOLP) model. In this problem, a proposed FMOLP method is applied with respect to the o...
متن کامل